Algorithm for computing Jordan basis

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

متن کامل

An algorithm for computing Grobner basis and the complexity evaluation

The first Gröbner basis algorithm was constructed by Buchberger in 1965; thus it bears his name to this day – Buchberger’s algorithm.[9] Though Buchberger’s algorithm looks relatively simple, it can take a very large amount of time. The step that creates 0 h via a normal form calculation is computationally very difficult. This is particularly frustrating (and wasteful) if the normal form calcul...

متن کامل

Asymptotic algorithm for computing the sample variance of interval data

The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...

متن کامل

A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS

Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...

متن کامل

BASIS PURSUIT BASED GENETIC ALGORITHM FOR DAMAGE IDENTIFICATION

In damage detection the number of elements is generally more than the number of measured frequencies. Consequently, the corresponding damage detection equation is undetermined and thus has infinite solutions. Since in the damaged structures most of their elements remain healthy, the sparsest solution for the damage detection equation is mostly the actual damage. In the proposed method, the dama...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JSIAM Letters

سال: 2010

ISSN: 1883-0609,1883-0617

DOI: 10.14495/jsiaml.2.119